Self-Adaptive Heuristics for Evolutionary Computation
نویسنده
چکیده
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. O. Kramer Self-Adaptive Heuristics for Evolutionary Computation
منابع مشابه
An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملAdaptive and Self-adaptive Evolutionary Computations
This paper reviews the various studies that have introduced adaptive and self-adaptive parameters into Evolutionary Computations. A formal definition of an adaptive evolutionary computation is provided with an analysis of the types of adaptive and self-adaptive parameter update rules currently in use. Previous studies are reviewed and placed into a categorization that helps to illustrate their ...
متن کاملSelf-adaptative and Coevolving Memetic Algorithms
Results from applications of meta-heuristics, and Evolutionary Computation in particular, have led to the widespread acknowledgement of two facts. The first is that evolutionary optimisation can be improved by the use of local search methods, creating so-called Memetic Algorithms. The second is that there is no single ”best” choice of memetic operators and parametersrather the situation changes...
متن کاملThe Impact of Mutation Rate on the Computation Time of Evolutionary Dynamic Optimization
Mutation has traditionally been regarded as an important operator in evolutionary algorithms. In particular, there have been many experimental studies which showed the effectiveness of adapting mutation rates for various static optimization problems. Given the perceived effectiveness of adaptive and self-adaptive mutation for static optimization problems, there have been speculations that adapt...
متن کاملOn self-adaptive features in real-parameter evolutionary algorithms
Due to the exibility in adapting to diierent tness landscapes, self-adaptive evolutionary algorithms (SA-EAs) have been gaining popularity in the recent past. In this paper, we postulate the properties that SA-EA operators should have for successful applications in real-valued search spaces. Speciically, population mean and variance of a number of SA-EA operators, such as various real-parameter...
متن کامل